Towards an Axiomatization of Simple Analog Algorithms
نویسندگان
چکیده
We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation. The states of ‘continuous’ machinery . . . form a continuous manifold, and the behaviour of the machine is described by a curve on this manifold. All machinery can be regarded as continuous, but when it is possible to regard it as discrete it is usually best to do so. The property of being ‘discrete’ is only an advantage for the theoretical investigator, and serves no evolutionary purpose, so we could not expect Nature to assist us by producing truly ‘discrete’ brains. Alan M. Turing, Intelligent Machinery, 1948
منابع مشابه
Simple axiomatization of reticulations on residuated lattices
We give a simple and independent axiomatization of reticulations on residuated lattices, which were axiomatized by five conditions in [C. Mureşan, The reticulation of a residuated lattice, Bull. Math. Soc. Sci. Math. Roumanie 51 (2008), no. 1, 47--65]. Moreover, we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...
متن کاملTowards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towards enabling mechanized verification within this technique is an axiomatization of implication between predicates which is purely semantically defined in [10]. In this paper we provide an axiomatization and illustrate...
متن کاملExact Exploration
Recent analysis of classical algorithms resulted in their axiomatization as transition systems satisfying simple postulates, and in the Abstract State Machine Theorem, stating that any such transition system can be programmed in a most general model of computation, called “abstract state machines”. In this way, classical abstract state machines answer the question “What is an algorithm?” for th...
متن کاملCharacterization and axiomatization of all semigroups whose square is group
In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup). Finally, several equivalent conditions ...
متن کاملTowards Analog Reverse Time Computation
We report the consequences of a destabilization process on a simulated General Purpose Analog Computer. This new technology overcomes problems linked with serial ambiguity, and provides an analog bias to encode algorithms whose complexity is over polynomial. We also implicitly demonstrate how countermesures of the Stochastic Aperture Degeneracy could efficiently reach higher computational class...
متن کامل